Geometric Criteria for Realizability of Tensegrities in Higher Dimensions

نویسندگان

چکیده

In this paper we study a classical Maxwell question on the existence of self-stresses for frameworks, which are called tensegrities. We give complete answer geometric conditions at most $(d...

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Realizability Criteria for Compositional MSC

Synthesizing a proper implementation for a scenario-based specification is often impossible, due to the distributed nature of implementations. To be able to detect problematic specifications, realizability criteria have been identified, such as non-local choice. In this work we develop a formal framework to study realizability of compositional MSC [GMP03]. We use it to derive a complete classif...

متن کامل

Geometric Morphisms of Realizability Toposes

We show that every geometric morphism between realizability toposes satisfies the condition that its inverse image commutes with the ‘constant object’ functors, which was assumed by John Longley in his pioneering study of such morphisms. We also provide the answer to something which was stated as an open problem on Jaap van Oosten’s book on realizability toposes: if a subtopos of a realizabilit...

متن کامل

Geometric Construction of the Quantum Hall Effect in Higher Dimensions

A clean geometric construction is presented for the recent generalization of the Quantum Hall Effect to higher dimensional spaces. A very explicit formula is derived for the Hamiltonian in the generalized Quantum Hall Effect. This explicit formula suggests that the quantum Hall effect in even dimensions larger than two turns out to be simply copies of the two-dimensional effect.

متن کامل

Efficient Approximation Algorithms for Point-set Diameter in Higher Dimensions

We study the problem of computing the diameter of a  set of $n$ points in $d$-dimensional Euclidean space for a fixed dimension $d$, and propose a new $(1+varepsilon)$-approximation algorithm with $O(n+ 1/varepsilon^{d-1})$ time and $O(n)$ space, where $0 < varepsilonleqslant 1$. We also show that the proposed algorithm can be modified to a $(1+O(varepsilon))$-approximation algorithm with $O(n+...

متن کامل

investigating the feasibility of a proposed model for geometric design of deployable arch structures

deployable scissor type structures are composed of the so-called scissor-like elements (sles), which are connected to each other at an intermediate point through a pivotal connection and allow them to be folded into a compact bundle for storage or transport. several sles are connected to each other in order to form units with regular polygonal plan views. the sides and radii of the polygons are...

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: SIAM Journal on Discrete Mathematics

سال: 2021

ISSN: ['1095-7146', '0895-4801']

DOI: https://doi.org/10.1137/19m1281903